Signature generation and verification system

ABSTRACT

Technologies are generally described for methods and devices for generating a final signature. The methods may comprise receiving a message by a processor. The methods may comprise generating a random number by a random number generator. The methods may comprise forwarding, by the processor, the random number to a cloaking element generator. The methods may comprise forwarding, by the processor, a private key to the cloaking element generator. The methods may comprise forwarding, by the processor, a group to the cloaking element generator. The methods may comprise forwarding, by the processor, a homomorphism to the cloaking element generator. The methods may comprise processing, by the cloaking element generator, the random number, the group, the private key, and the homomorphism to produce a cloaking element. The methods may comprise applying the cloaking element to transform the message into the final signature.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation-in-part of U.S. application Ser. No. 15/270,930 filed Sep. 20, 2016, entitled “SIGNATURE GENERATION AND VERIFICATION SYSTEM”, which, in turn, claims priority to provisional patent application No. 62/221,881 filed Sep. 22, 2015. Both of these applications are hereby incorporated by reference in their entirety.

BACKGROUND

In a symmetric or private key encryption communication system, two devices in possession of a common secret or private key can perform both encryption and decryption using the secret key. A plaintext message may be encrypted using the secret key to produce encrypted plaintext or a cyphertext. The cyphertext may be decrypted using the secret key to re-produce the plaintext. The cyphertext may be accompanied by a signature. A receiver of the signature may process the signature to verify the authenticity of the sender.

SUMMARY OF THE INVENTION

One embodiment of the invention is a method for generating a final signature. The methods may comprise receiving a message by a processor. The methods may comprise generating a random number by a random number generator. The methods may comprise forwarding, by the processor, the random number to a cloaking element generator, where the private key includes an ordered pair. The methods may comprise forwarding, by the processor, a private key to the cloaking element generator. The methods may comprise forwarding, by the processor, a group to the cloaking element generator. The methods may comprise forwarding, by the processor, a homomorphism to the cloaking element generator. The methods may comprise processing, by the cloaking element generator, the random number, the group, the private key, and the homomorphism to produce a first, second and third cloaking element. The methods may comprise applying the cloaking element to transform the message into the final signature.

Another embodiment of the invention includes a signature generator. The signature generator may comprise a memory. The signature generator may comprise a random number generator. The random number generator may be effective to generate a random number. The signature generator may comprise a cloaking element generator. The signature generator may comprise a processor. The processor may be configured to be in communication with the memory, the random number generator, and the cloaking element generator. The processor may be effective to receive a message. The processor may be effective to forward the random number to the cloaking element generator. The processor may be effective to forward a private key to the cloaking element generator. The private key may include an ordered pair. The processor may be effective to forward a group to the cloaking element generator. The processor may be effective to forward a homomorphism to the cloaking element generator. The cloaking element generator may be effective to process, the random number, the group, the private key, and the homomorphism to produce a first, second and third cloaking element. The processor may be effective to apply the cloaking element to the message to transform the message into the final signature.

Another embodiment of the invention are methods to generate a verification result for a signature. The methods may comprise receiving, by a processor, a final signature that includes a cloaked signature and a message. The methods may comprise forwarding, by the processor, the message to a message encoder. The methods may comprise forwarding, by the processor, a group to the message encoder. The methods may comprise processing, by the message encoder, the group and the message to produce an encoded message. The methods may comprise forwarding, by the processor, the encoded message to an encoded message image generator. The methods may comprise processing, by the encoded message image generator, the encoded message to produce an ordered pair. The ordered pair may take the form of a first and second component of a public key. The methods may comprise forwarding, by the processor, the ordered pair to a signature verifier. The methods may comprise forwarding, by the processor, the public key to the signature verifier. The methods may comprise forwarding, by the processor, the final signature to the signature verifier. The methods may comprise processing, by the signature verifier, the first component of the public key and the cloaked signature to produce a first computation. The methods may comprise processing, by the signature verifier, the second component of the public key to produce a second computation. The methods may comprise comparing, by the processor, the first and second computation to generate the verification result.

BRIEF DESCRIPTION OF THE FIGURES

The foregoing and other features of this disclosure will become more fully apparent from the following description and appended claims taken in conjunction with the accompanying drawings. Understanding that these drawings depict only some embodiments in accordance with the disclosure and are therefore not to be considered limiting of its scope, the disclosure will be described with additional specificity and detail by reference to the accompanying drawings in which:

FIG. 1 is a drawing of a communication system in accordance with an embodiment of the invention.

FIG. 2 is a drawing of a communication system in accordance with an embodiment of the invention.

FIG. 3 is a flow diagram illustrating a process which could be performed in accordance with an embodiment of the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT(S)

In the following detailed description, reference is made to the accompanying drawings which form a part thereof. In the drawings, similar symbols typically identify similar components unless context indicates otherwise. The illustrative embodiments described in the detailed description, drawings and claims are not meant to be limiting. Other embodiments may be utilized and other changes may be made without departing from the spirit or scope of the subject matter presented herein. It will be readily understood that the aspects of the present disclosure as generally described herein and as illustrated in the accompanying figures can be arranged, substituted, combined, separated and/or designed in a wide variety of different configurations all of which are explicitly contemplated herein.

FIG. 1 is a drawing of a communication system 100 in accordance with an embodiment of the invention. Communication system 100 may include a signature generator 106, a network 110, and/or a processor 156. Network 110 may include, for example, a wireless network, a wired network, the Internet, a cellular network, a near field communication (NFC) network, a radio frequency identification (RF-ID) network, a cloud computing environment, etc. Signature generator 106 may include a processor 112, a memory 144, a pseudo random number generator 126, a hash function 118, a message encoder 120, a cloaking element generator 130, a raw signature generator 160, and a final signature generator 170, all configured to be in communication with each other. Memory 144 may store a group S 142, a group G 122, a group

146, a group N 148, a homomorphism φ 140, a homomorphism Π 152, a signer private key Priv (S) 114, a public key Pub(s) 116, and an obscuring rewriting operation

154. In some examples, signer private key Priv (S) may include an ordered pair, (Priv(S₁), Priv(S₂)). In some examples, public key Pub(s) may include an ordered pair (Pub (S₁), Pub(S₂)).

As explained in more detail below, the elements stored in memory may satisfy the following properties:

A group S may be a group that acts on a group

;

A group G may be equipped with an obscuring rewriting method denoted

;

Group

may be acted on by the group S;

A group N may be equipped with a one-way homomorphism Π: M→N; and

φ may be a homomorphism where φ: G→

S.

Group S 142, group G 122, group

146, group N 148, homomorphism φ 140, homophorphism Π 152, signer private key Priv (S) 114, which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)), and obscuring rewriting operation

154 may be utilized in computations such as an Algebraic Eraser and an E-function of E-multiplication as described below.

An Algebraic Eraser may be an instance of a one-way function on which an asymmetric encryption protocol may be based. An Algebraic Eraser may include a specified 6-tuple (

S, N, Π, E, A, B) where

M and N are monoids,

S is a group that acts on

(on the left),

S denotes the semi-direct product,

A and B denote submonoids of

S, and

Π denotes a monoid homomorphism from M to N. The E-function, also called E-multiplication, is defined by E:(N×S)×(

S)→(N×S) E((n, s),(m ₁ , s ₁))=(nΠ(^(s) m ₁),s s ₁)=(n,s)*(m ₁ ,s ₁).

It is observed that the E-function satisfies the following identity: E((n,s), ((m ₁ ,s ₁)·(m ₂ ,s ₂)))=E(E((n,s), (m ₁ ,s ₁)), (m ₂ ,s ₂)).

In system 100, a first user 102 may input a message M 104 into signature generator 106. For example, user 102 may use processor 112 to input message 104. As discussed in more detail below, signature generator 106 may be effective to transform message 104 and signer private key Priv(S) 114, which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)), into a final signature 108—shown as “(Signature (M), M)”. Signature generator 106 may then send final signature 108 through network 110 to processor 156. A user 150 in communication with processor 156 may receive and verify final signature 108 to produce a verification result 160.

Signer private key Priv(S) 114 may be related to a signer public key Pub(S) 116. Signer private key Priv(S) 114 and signer public key Pub(S) 116 may be a fixed private/public key pair that may be computed with use of the algebraic eraser discussed above. Signer private key Priv(S) 114 may be an element in group G 122, i.e.: Priv(S)∈G

Signer private key Priv(S) 114, which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)),may be chosen in a manner so that the search space for signer private key Priv(S) 114 is difficult to enumerate. Signer public key Pub(S) 116, which in some cases may be an ordered pair, (Pub(S₁), Pub(S₂)), may be derived using E-multiplication on signer private key Priv(S) 114, i.e.: Pub(S)=(1,1)*(M _(Priv(S)) , s _(Priv(S))), or in the case Priv(S) 114 takes the form ((Priv(S₁), Priv(S₂)) Pub(S ₁)=(1,1)*(M _(Priv(S) ₁ ₎ , s _(Priv(S) ₁ ₎), Pub(S ₂)=(1,1)*(M _(Priv(S) ₂ ₎ , s _(Priv(S) ₂ ₎), where * denotes E-multiplication, as described above and given any element ν∈G, let M_(ν), and s_(ν) be defined by ϕ(ν)=(M_(ν), s_(ν)). Processor 112 may forward message M 104 and group G 122 to message encoder 120. In some examples, hash function 118 may receive message M and forward a hash of message M to message encoder 120. Message encoder 120 may associate a unique element in a free subgroup of group G 122 to message M 104 to produce an encoded message E(M) 124. Encoded message E(M) 124 may have the property that φ(E(M)) has a trivial second component.

Pseudo random number generator 126 may generate an output number 128. Pseudo random number generator 126 may be based on either message M 104, signer private key Priv(S) 114, or both. Processor 112 may forward random number 128, signer private key Priv(S) 114, and φ 140 to cloaking element generator 130. Cloaking element generator 130 may, in response, produce cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 in the group G 122. Cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 may serve to cloak signer private key Priv(S) 114 as explained in more detail below.

Given an element s∈S, cloaking element generator 130 may generate cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132∈G, termed cloaking elements associated with s, and s₁ or, respectively s, s₁ and s₂. Cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 may facilitate signature generation and verification. Cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 may have images under the homomorphism φ that stabilizes elements (1, 1) and (1, s) respectively (1, 1), (1, s₁), (1, s₂). Definitionally, this means (1, 1)*(M_(ν), id)=(1, 1) and (1, s)*(M_(ν) ₁ , id)=(1, s), respectively, (1, 1)*(M_(ν), id)=(1, 1), (1, s₁)*(M_(ν) ₁ , id), (1, s₂)*(M_(ν) ₂ , id).

Processor 112 may forward encoded message 124, private key 114, and cloaking elements 132 to raw signature generator 160. Raw signature generator 160 may produce the element (Priv(S)⁻¹ ν E(M) Priv(S) ν₁), respectively ν₁ (Priv(S₁)⁻¹ ν E(M) Priv(S₂) ν₂), a raw signature 168 which may be a group element.

Processor 112 may forward raw signature 168 and message 104 to final signature generator 170. Final signature generator 170 may apply rewrite operation

154 to raw signature 168 of the message M 104 to produce final signature 108. Final signature 108 may include a rewritten signature 154 and message 104. It is noted that E-multiplication of final signature 108 by public key 116 would cause cloaking elements 132 to disappear. Cloaking elements 132 may thus prevent potential weaknesses which could arise in examples where solving equations in group G is not sufficiently difficult. Final signature 108 may take the form: Final Signature=(

(Priv(S)⁻¹ ν E(M) Priv(S) ν₁), M) respectively, Final Signature=(

(ν₁ Priv(S ₁)⁻¹ ν E(M) Priv(S ₂) ν₂), M).

FIG. 2 is a drawing of a communication system 200 in accordance with an embodiment of the invention. Communication system 200 may include a signature verification generator 202 and network 110. Signature verification generator 202 may include a processor 156, a memory 204, a message encoder 220, an encoded message image generator 206, and a signature verifier 208, all configured to be in communication with each other. Memory 204 may store group S 142, group G 122, group M 146, group N 148, homomorphism φ 140, homomorphism “Π” 152, signer private key Priv (S) 214 which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)), a signer public key Pub(S) 216, which in some cases may be an ordered pair, (Pub(S₁), Pub(S₂)), and obscuring rewriting operation

154.

Signature verification generator 202 may receive final signature 108 including rewritten signature 154 and message 104 over network 110. Processor 156 may forward message M 104 and group G 122 to message encoder 220. Message encoder 220 may associate a unique element in a free subgroup of group G 122 to message M 104 to produce an encoded message E(M) 224.

Processor 156 may forward encoded message 224 to encoded message image generator 206. Encoded message image generator 206 may apply a function to encoded message 124 to produce output P(E(M)) 210 which may be an ordered pair in N×S: P(E(M))=(1,1)*(M _(E(M)) ,id)∈N×S.

Processor 156 may forward output P(E(M)) 210, final signature 108 and public key Pub(S) 216, which in some cases may be an ordered pair, (Pub(S₁), Pub(S₂)), to signature verifier 208. Signature verifier 208 may process public key 216 and rewritten signature 108 as follows: Pub(S)*

(Priv(S)⁻¹ ν E(M)Priv(S)ν₁), or, respectively Pub(S ₁)*

(ν₁ Priv(S ₁)⁻¹ ν E(M)Priv(S ₂)ν₂) to produce a first computation. Signature verifier 208 may process first components of P(E(M)) and Pub(s) as follows: First Component(P(E(M)))·First Component(Pub(S)), or, respectively, First Component(P(E(M)))·First Component(Pub(S ₂)), to produce a second computation.

Signature verifier 208 may compare the first and second computations to generate verification result 190. If signature verifier 208 determines that the outputs of the above computations are equal, signature verifier may output verification result 190 as YES indicating that the signature has been verified as produced by the signer. If signature verifier 208 determines that the outputs of the above computations are not equal, signature verifier may output verification result 190 as NO indicating that the signature has not been verified as produced by the signer.

Among other benefits, a system in accordance with this disclosure may enable a receiving device to authenticate and verify the origin of a message. A receiving device may be able to demonstrate the integrity of a message at a future point in time. A receiving device may be able to prevent a signer of a message from denying generation and transmission of a message that has been verified to have been sent by a signer. A system in accordance with this disclosure may be resistant to attacks. A receiving device may be able to execute a verification of a message sender relatively rapidly.

EXAMPLE

Let G denote the n-strand braid group with Artin generators, {b₁, b₂, b_(n−1)} which are subject to the following identities: b _(i) b _(i+1) b _(i) =b _(i+1) b _(i) b _(i+1), (i=1, . . . , n−1), and b _(i) b _(j) =b _(j) b _(i)·(i,j with |i−j|≥2).

Let M denote the group of n×n matrices with n-variable Laurent polynomial entries, and let S denote the group of permutations on n symbols. We extend the action of S to an action on n-variable Laurent polynomials, and further to an action on the group

. Forming the semidirect product,

S, we define the function ϕ: G→

S as follows. Each generator b_(i) is associated with the permutation σ_(i) which maps i>i+1, i+1→i, and leaves {1, . . . , i−1, i+2, . . . , n} fixed, and an element ß=b_(i) ₁ ^(∈) ¹ b_(i) ₂ ^(∈) ² . . . b_(i) _(k) ^(∈) ^(l) ∈G, (i_(j)∈{1, . . . , n−1}, and ∈_(j)=±1), is associated with the product of the permutations σ_(ß)=σ_(i) ₁ ·σ_(i) ₂ · . . . σ_(i) _(k) . Associate to each b_(i) the ordered pair of the n×n colored Burau matrix CB(b_(i)) whose entries are polynomials in the N variables {t₁, t₂, . . . , t_(n)}, together with the permutation σ_(i). These ordered pairs form a semi-direct product

S, and allow for the function φ: G→

S, to be defined:

ϕ(ß)=(CB(ß), σ_(ß)). In the case n=4, the matrices CB(b_(i)), CB(b₂), and CB(b₃) are defined as follows (the general case is entirely analogous):

$\begin{pmatrix} {- t_{1}} & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix},\begin{pmatrix} 1 & 0 & 0 & 0 \\ t_{2} & {- t_{2}} & 1 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix},{\begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & t_{3} & {- t_{3}} & 1 \\ 0 & 0 & 0 & 1 \end{pmatrix}.}$

Further we observe that in the case n=4, with the general case being entirely analogous, CB(b₁ ⁻¹), CB(b₂ ⁻¹), and CB(b₃ ⁻¹) are given by the following matrices, respectively:

$\begin{pmatrix} {- \frac{1}{t_{2}}} & \frac{1}{t_{2}} & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix},\begin{pmatrix} 1 & 1 & 0 & 0 \\ 1 & {- \frac{1}{t_{3}}} & \frac{1}{t_{3}} & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix},{\begin{pmatrix} 1 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 1 & {- \frac{1}{t_{4}}} & \frac{1}{t_{4}} \\ 0 & 0 & 0 & 1 \end{pmatrix}.}$

Referring to the instance of E-multiplication specified above, the group N is specified as the group of n×n matrices over a finite field F_(q), and the function Π:

→N is specified by a collection of n invertible elements in F_(q), termed t-values: the function Π evaluates every in M∈

at the specified t-values. In this example of the preferred embodiment E-multiplication is specifically given by (N ₀ ,s ₀)*(M,s)=(N ₀·Π(^(s) ⁰ M), s ₀ s).

This instance, which is based on the n-strand braid group, G, may be specified by the following data:

-   A specified rewriting operation, which may be a canonical form     algorithm, or a modified canonical form algorithm,     :B_(n)→B_(n). -   A Pseudo Random Number Generator, PRNG, which may be responsive to     either or both the message, M, and the Signer's private key,     Priv(S), which in some cases may be an ordered pair, (Priv(S₁),     Priv(S₂)). -   A collection of n nonzero elements in the finite field F_(q), termed     T-values, which are denoted by {τ₁, τ₂, . . . , τ_(N)}. -   Two integers 1<a<b<n, such that τ_(a)=τ_(b)=1. -   The Signer has a private key, Priv(S)∈G, which in some cases may be     an ordered pair, (Priv(S₁), Priv(S₂)), where Priv(S₁), Priv(S₂)∈G.     and a public key which in some cases may be an ordered pair,     (Pub(S ₁),Pub(S ₂)), -   where     Pub(S)=(1,1)*(M _(Priv(S)) , s _(Priv(S))).     or, respectively,     Pub(S ₁)=(1,1)*(M _(Priv(S) ₁ ₎ , s _(Priv(S) ₁ ₎), Pub(S     ₂)=(1,1)*(M _(Priv(S) ₂ ₎ , s _(Priv(S) ₂ ₎).

Referring again to FIG. 1, first user 102 inputs the Message M 104 to be signed, or the output of a cryptographic hash function applied to the Message M, to message encoder 120, which is responsive to the input of a free subgroup of the group G 122. The n-strand braid group contains a free subgroup, which is contained in the pure braid subgroup and is generated by the collection of braids b _(n−1) ·b _(n−2) . . . b _(i+1) ·b _(i) ² ·b ₁₊₁ ⁻¹ · . . . ·b _(n−1) ⁻¹ (i=1, . . . , n−2).

Since subgroups of free groups are themselves free, there are many possible choices of free subgroups that may specify the message encoder 120. Message M 104 may be broken into blocks of length 4, and each such block may be associated with a unique power of one of the braids specified above. In addition, the output of the message encoder 120, may satisfy the property that the second component of ϕ(E(M)) is the identity. The output of message encoder 120, encoded message E(M) 124, is forwarded to raw signature generator 160. Concurrent to the message being forwarded to the message encoder 120, the Signer's private key Priv(S) 114, which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)), which may be one or more elements of the group G 122, is forwarded to both the cloaking element generator 130 and the raw signature generator 160. Cloaking element generator 130 is responsive to the output number 128 of a Pseudo Random Number Generator, PRNG 126. PRNG 136 may itself be responsive to either or both the message M 104 and the Singer's private key, Priv(S) 114 which in some cases may be an ordered pair, (Priv(S₁), Priv(S₂)) if it is desirable that the apparatus produce the same signature of the message M 104 whenever it is called upon. If it is desirable to produce a signature that is not stagnant, PRNG 126 may operate independently of the message M 104. Both group G 122, and homomorphism ϕ 140 are forwarded to the cloaking element generator 130, which outputs cloaking elements, ν₁ or ν, ν₁, ν₂ 132 of the group G 122 that satisfy the cloaking property: (1,1)*(M _(ν) ,id)=(1,1) (Π(M _(Priv(S))), s _(Priv(S)))*(M _(ν) ₁ ,id)=(Π(M _(Priv(S))), s _(Priv(S))). or respectively, (1,1)*(M _(ν) ,id)=(1,1) (Π(M _(Priv(S) ₁ ₎), s _(Priv(S) ₁ ₎)*(M _(ν) ₁ ,id)=(Π(M _(Priv(S) ₁ ₎), s _(Priv(S) ₁ ₎), (Π(M _(Priv(S) ₂ ₎), s _(Priv(S) ₂ ₎)*(M _(ν) ₁ ,id)=(Π(M _(Priv(S) ₂ ₎), s _(Priv(S) ₂ ₎),

In the present example, the cloaking elements, ν₁ or ν, ν₁, ν₂ 132 may be generated in the following general way. In general given a permutation, σ∈S_(N), there are many braids ß∈G that have σ as its associated permutation. In addition, if such a braid ß is multiplied by a braid whose associated permutation is the identity, termed a pure braid, the resulting product will yet again have the same permutation as the original braid ß. Furthermore, any two braids, which have the same associated permutation, will differ by a pure braid. The cloaking element generator 130 may produce the element ν∈G by choosing an i∈{1, 2, . . . , n−1} via the output number 128 of PRNG 126, choosing a permutation in S_(N) that maps i→a, i+1→b, and then producing an element in γ∈G which has said associated permutation. The element γ may be multiplied by an element in the pure braid subgroup, and this new element, which may also be denoted by γ, may be used by the cloaking element generator 130 to produce the element ν. The cloaking element generator 130 may produce element ν by forming the product in the group G 122, ν=γb _(i) ²γ⁻¹. The output of this process will satisfy the essential identity (1,1)*(M _(ν) ,id)=(1,1).

The cloaking element generator 130 may produce the element ν₁∈G by choosing an i∈{1, 2, . . . , n−1} via the input of the output number 128 of PRNG 126, choosing a permutation in S_(N) that maps i→s _(Priv(S)) ⁻¹(a), i+1→s _(Priv(S)) ⁻¹(b)

and then producing an element in γ₁∈G which has said associated permutation. The element γ₁ may be multiplied by an element in the pure braid subgroup, and this new element, which may also be denoted by γ₁, may be used by the cloaking element generator 130 to produce the element ν₁. The cloaking element generator 130 may produce the element ν₁ by forming the product in the group G 122, ν₁=γ₁ b _(i) ²γ₁ ⁻¹. The output of this process will satisfy the essential identity (Π(M _(Priv(S))), s _(Priv(S)))*(M _(ν) ₁ ,id)=(Π(M _(Priv(S))), s _(Priv(S))).

In the case there are three cloaking elements, ν, ν₁, ν₂, the cloaking element ν may be produced as above, and the cloaking elements ν₁, ν₂ may be produced by choosing an i₁, i₂∈{1, 2, . . . , n−1} via the input of the output number 128 of PRNG 126, choosing permutations in S_(N) that maps i ₁ →s ⁻¹ _(Priv(S) ₁ ₎(a), i ₁+1→s ⁻¹ _(Priv(S) ₁ ₎(b) i ₂ →s ⁻¹ _(Priv(S) ₂ ₎(a), i ₁+1→s ⁻¹ _(Priv(S) ₂ ₎(b) and then producing elements in γ₁, γ₂∈G which have said associated permutations, respectively. The elements γ₁, γ₂ may be multiplied by an element in the pure braid subgroup, and this new element, which may also be denoted by γ₁, γ₂, may be used by the cloaking element generator 130 to produce the element ν₁, ν₂. The cloaking element generator 130 may produce the elements ν₁, ν₂ by forming the product in the group G 122, ν₁=γ₁ b² _(i) ₁ γ₁ ⁻¹, ν₂=γ₂ b² _(i) ₂ γ₂ ⁻¹ The output of this process will satisfy the essential identities (Π(M _(Priv(S) ₁ ₎), s _(Priv(S) ₁ ₎)*(M _(ν) ₁ , id)=(Π(M _(Priv(S) ₁ ₎), s _(Priv(S) ₁ ₎), and (Π(M _(Priv(S) ₂ ₎), s _(Priv(S) ₂ ₎)*(M _(ν) ₂ , id)=(Π(M _(Priv(S) ₂ ₎), s _(Priv(S) ₂ ₎).

The cloaking elements v, v₁ v, v₁, v₂ 132 are forwarded to the raw signature generator 160. The raw signature generator 160 has in memory the set of group elements {E(M), Priv(S), ν, ν₁} or {E(M), Priv(S), ν, ν₁, ν₂} and proceeds to output the group element 168 Priv(S)⁻¹ ν E(M) Priv(S) ν₁. respectively ν₁ Priv(S ₁)⁻¹ ν E(M) Priv(S ₂) ν₂.

Group element 168, together with the original message M 104, which may be the result of a cryptographic hash function applied to a message, is forwarded to the final signature generator 170. The final signature generator 170 applies the rewriting operation,

154, which was specified in the public data, to group element 168 Priv(S)⁻¹ ν E(M) Priv(S) ν₁ respectively, Priv(S₁)⁻¹ ν E(M) Priv(S₂) ν₂. The action of rewriting operation is to obscure all of the individual components of group element 168 Priv(S)⁻¹ ν E(M) Priv(S) ν₁, respectively, ν₁ Priv(S₁)⁻¹ ν E(M) Priv(S₂) ν₂ and the expression generated by the rewriting operation

154 is denoted

(Priv(S)⁻¹ ν E(M) Priv(S) ν₁) respectively,

(ν₁ Priv(S ₁)⁻¹ ν E(M) Priv(S ₂) ν₂)

A feature of the cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 is that when the output of the final signature generator 170 is E-multiplied by the public key Pub(S) 116 of the signer, the cloaking elements ν, ν₁ or ν, ν₁, ν₂ 132 disappear. The output of the final signature generator 170 is final signature 108 ordered pair Final Signature=(

(Priv(S)⁻¹ ν E(M) Priv(S) ν₁), M). respectively, Final Signature=(

(ν₁ Priv(S ₁)⁻¹ ν E(M) Priv(S ₂) ν₂), M).

Signature verification generator 202 may receive final signature 108 (

(Priv(S)⁻¹ ν E(M) Priv(S) ν₁), M), respectively, (

(ν₁ Priv(S₁)⁻¹ ν E(M) Priv(S₂) ν₂), M) including rewritten signature 154 and message 104. Signature verification generator 202 may forward message M 104 and group G 122 to message encoder 220. Message encoder 220 may associate a unique element in a free subgroup of group G 122 to message M 104 to produce an encoded message E(M) 224. Signature verification generator 202 may forward encoded message E(M) 224 to encoded message image generator 206. Encoded message image generator 206 may apply a function to encoded message 124 to produce output P(E(M)) 210 which may be an ordered pair in N×S, P(E(M))=(1,1)*(M _(E(M)) , id)∈N×S.

Signature verification generator 202 may forward output P(E(M)) 210, final signature 108, and public key Pub(S)), which in some cases may be an ordered pair, (Pub(S₁), Pub(S₂)), 216 to signature verifier 208. Signature verifier 208 may process public key 216 and rewritten signature 108 by execution of the E-multiplication Pub(S)*

(Priv(S)⁻¹ ν E(M) Priv(S) ν₁), or, respectively, Pub(S ₁)*

(ν₁ Priv(S ₁)⁻¹ ν E(M) Priv(S ₂) ν₂) and the group multiplication of the first components of P(E(M)) and Pub (S), First Component(P(E(M)))·First Component(Pub(S)). or, respectively, First Component(P(E(M)))·First Component(Pub(S ₂)). If the outputs of the above-executed computations are equal, signature verifier 208 outputs YES, which indicates the Signature has been verified. If the above executed computations are not equal, the signature verifier 208 outputs NO, which indicates the Signature cannot be verified as having been produced by the Signer.

Referring to FIG. 3, there is shown a process which could be performed in accordance with an embodiment of the invention. The process could be performed using, for example, system 100 discussed above and may be used to generate a final signature.

As shown, at step S2, a processor may receive a message. At step S4, a random number generator may generate a random number.

At step S6, the processor may forward the random number to a cloaking element generator. At step S8, the processor may forward a private key which may be include an ordered pair, to the cloaking element generator.

At step S10, the processor may forward a group to the cloaking element generator. The private key may be an element, or a pair of elements, in the group. The group may be equipped with an obscuring rewriting method. At step S12, the processor may forward a homomorphism to the cloaking element generator.

At step S14, the cloaking element generator may process the random number, the group, the private key, which may be a pair of elements, and the homomorphism to produce a first, second and third cloaking element. At step S16, the processor may apply the cloaking element to transform the message into the final signature.

While various aspects and embodiments have been disclosed herein, other aspects and embodiments will be apparent to those skilled in the art. The various aspects and embodiments disclosed herein are for purposes of illustration and are not intended to be limiting, with the true scope and spirit being indicated by the following claims. 

What is claimed is:
 1. A method for generating a final cloaked signature, the method comprising: receiving a message by a processor; generating a random number by a random number generator of the processor; processing, by a cloaking element generator of the processor; the random number, a braid group B_(N) generated by {b₁, . . . b_(n-1)}, a private key that is an element of the braid group, respectively, a pair of elements in the braid group, and a homomorphism to produce a first and second, respectively, a first, second and third cloaking element that are elements of the braid group and that act as stabilizers, thereby satisfying a predetermined cloaking equation taking a form wherein (1,1)*(M_(v), id)=(1,1) and (1,s)*(M_(v1), id)=(1,s), respectively, (1,1)*(M_(v), id)=(1, 1), (1, s₁)*(M_(v1), id), (1, s₂)*(M_(v2), id), where * denotes E-multiplication, N is an n×n matrix group over a finite field, s, s₁, and s₂ are elements of S, where S denotes a permutation group on n symbols, v, v₁, and v₂ are braid group elements that act as cloaking elements, M_(v), M_(v1), and M_(v2) are colored Burau matrices associated with v, v₁, and v₂, respectively, and id is an identity permutation in the permutation group; processing, by a message encoder of the processor, the private key and the message to produce an encoded message; processing, by a raw signature generator of the processor, the first, second, and third cloaking element and the encoded message to produce a raw signature; processing, by a final signature generator of the processor, the raw signature and the message to produce the final cloaked signature, the processing including applying the cloaking element to at least the message to transform the message into the final cloaked signature, the applying including applying the cloaking element to the encoded message, the final cloaked signature providing verification of an origin of the message, the final cloaked signature taking a form (R(Priv(S)⁻¹ v E(M) Priv(S) v₁), M), respectively, R(v₁ Priv(S₁)⁻¹ v E(M) Priv(S₂) v₂), M), where Priv(S), Priv(S₁), and Priv(S₂) denote signer private keys, M denotes the message, E(M) denotes the encoded message, and R denotes a rewriting operator that is a function executing a sequence of insertions and/or deletions of braid identities in the braid group to derive a new expression of the braid group, the braid identities comprising: b_(i) b_({i+1}) b_(i)=b_({i+1}) b_(i) b_({i+1}) and b_(i) b_(i)=b_(i) b_(i) (when |i=j|> or =2); and sending, by the processor, the final cloaked signature to a receiver.
 2. The method of claim 1, wherein the message encoder is configured to produce the encoded message such that the encoded message is an element of a free subgroup of the group.
 3. The method of claim 1, wherein the final cloaked signature includes a rewritten signature and the message.
 4. The method of claim 1, wherein processing by the final signature generator includes applying a rewriting operation to the raw signature.
 5. The method of claim 1, wherein applying the cloaking elements to the message includes applying the cloaking elements to a hash of the message.
 6. The method of claim 5, wherein the hash is a hash of the private key and the message.
 7. The method of claim 1, wherein the random number generator generates the random number based on the message or based on the braid group.
 8. A signature generator comprising: a memory; and a processor in communication with the memory, the processor comprising a random number generator configured to generate a random number, a message encoder, a raw signature generator, a final signature generator, and a cloaking element generator, wherein the processor is configured to: receive a message; generate a random number by the random number generator; process, by the cloaking element generator; the random number, a braid group B_(N) generated by {b₁, . . . b_(n-1)}, a private key that is an element of the braid group, respectively, a pair of elements in the braid group, and a homomorphism to produce a first and second, respectively, a first, second and third cloaking element that are elements of the braid group and that act as stabilizers, thereby satisfying a predetermined cloaking equation taking a form wherein (1,1)*(M_(v), id)=(1,1) and (1,s)*(M_(v1), id)=(1,s), respectively, (1,1)*(M_(v), id)=(1, 1), (1, s₁)*(M_(v1), id), (1, s₂)*(M_(v2), id), where * denotes E-multiplication, N is an n×n matrix group over a finite field, s, s₁, and s₂ are elements of S, where S denotes a permutation group on n symbols, v, v₁, and v₂ are braid group elements that act as cloaking elements, M_(v), M_(v1), and M_(v2) are colored Burau matrices associated with v, v₁, and v₂, respectively, and id is an identity permutation in the permutation group; process, by the message encoder, the private key and the message to produce an encoded message; process, by the raw signature generator, the first, second, and third cloaking element and the encoded message to produce a raw signature; process, by the final signature generator, the raw signature and the message to produce the final cloaked signature, the processing including applying the cloaking element to at least the message to transform the message into the final cloaked signature, the applying including applying the cloaking element to the encoded message, the final cloaked signature providing verification of an origin of the message, the final cloaked signature taking a form (R(Priv(S)⁻¹ v E(M) Priv(S) v₁), M), respectively, R(v₁ Priv(S₁)⁻¹ v E(M) Priv(S₂) v₂), M), where Priv(S), Priv(S₁), and Priv(S₂) denote signer private keys, M denotes the message, E(M) denotes the encoded message, and R denotes a rewriting operator that is a function executing a sequence of insertions and/or deletions of braid identities in the braid group to derive a new expression of the braid group, the braid identities comprising: b_(i) b_({i+1}) b_(i)=b_({i+1}) b_(i) b_({i+1}) and b_(i) b_(i)=b_(i) b_(i) (when |i=j|> or =2); and send the final cloaked signature to a receiver.
 9. The signature generator of claim 8, wherein the processor is configured to produce, by the message encoder, the encoded message such that the encoded message is an element of a free subgroup of the group.
 10. The signature generator of claim 8, wherein the final cloaked signature includes a rewritten signature and the message.
 11. The signature generator of claim 8, wherein the final signature generator is configured to apply a rewriting operation to the raw signature.
 12. The signature generator of claim 8, wherein applying the cloaking element to at least the message includes applying the cloaking element to a hash of at least the message.
 13. The signature generator of claim 12, wherein the hash is a hash of the private key and the message.
 14. A method to generate a verification result for a signature, the method comprising: receiving, by a processor, a final signature that includes a cloaked signature and a message from a purported message origin; processing, by a message encoder of the processor, a braid group B_(N) generated by {b₁, . . . b_(n-1)} and the message to produce an encoded message; processing, by an encoded message image generator of the processor, the encoded message to produce an ordered pair of elements of the braid group, wherein the ordered pair takes the form of (Pub(S₁), Pub(S₂)), where Pub(S₁) is a first component of a public key and Pub(S₂) is a second component of the public key; processing, by a signature verifier of the processor, the first component of the public key and the cloaked signature as Pub(S)*(R(Priv(S)⁻¹ v E(M) Priv(S) v₁) or, respectively, Pub(S₁)*(R(v₁ Priv(S₁)⁻¹ v E(M) Priv(S₂) v₂) to produce a first computation, where * denotes E-multiplication, Pub(S), respectively Pub(S₁), Pub(S₂) denote the public key, Priv(S), respectively Priv(S₁), and Priv(S₂) denote signer private keys, M denotes the message, E(M) denotes the encoded message, v and v₁, respectively v, v₁, v₂, denote braid group elements that act as cloaking elements, and R denotes a rewriting operator that is a function executing a sequence of insertions and/or deletions of braid identities in the braid group to derive a new expression of the braid group, the braid identities comprising: b_(i) b_({i+1}) b_(i)=b_({i+1}) b_(i) b_({i+1}) and b_(i) b_(j)=b_(j) b_(i) (when |i=j|> or =2); processing, by the signature verifier of the processor, the ordered pair and the second component of the public key as First Component(P(E(M)))·First Component(Pub(S)) or, respectively, First Component(P(E(M)))·First Component(Pub(S₂)) to produce a second computation, where P(E(M)) denotes the ordered pair according to P(E(M))=(1,1)*(M_(E(M)), id)∈N×S, M_(E(M)) is a colored Burau matrix associated the encoded message, id is an identity permutation in the permutation group, N is an n×n matrix group over a finite field, and S denotes a permutation group on n symbols; and comparing, by the processor, the first and second computation to generate the verification result, wherein: the verification result indicates that the final signature was produced by the purported message origin in response to the comparing indicating that the first and second computations are equal, and the verification result indicates that the final signature was not produced by the purported message origin in response to the comparing indicating that the first and second computations are not equal. 